/**
 * @version Create on 2012-10-29
 * @author Yinzi Chen
 */

public class ClimbingStairs {

	public int climbStairs(int n) {
		int d[] = new int[n + 1];
		d[0] = 1;
		d[1] = 1;
		for (int i = 2; i <= n; ++i) {
			d[i] += d[i - 1] + d[i - 2];
		}
		return d[n];
	}

	public static void main(String[] args) {

	}

}
